Rooted Wreath Products
نویسندگان
چکیده
We introduce “rooted valuation products” and use them to construct universal Abelian lattice-ordered groups (with prescribed set of components) [CHH] from the more classical theory of [Ha]. The Wreath product construction of [H] and [HMc] generalised the Abelian (lattice-ordered) group ideas to a permutation group setting to respectively give universals for transitive (`-) permutation groups with prescribed set of primitive components. In the case of (not necessarily transitive) sublattice subgroups of order-preserving permutations of totally ordered sets, the set of natural congruences forms a root system. We generalise the rooted valuation product construction to the permutation case when all natural primitive components are regularly obtained; we analogously obtain universals for these permutation groups (for a prescribed set of natural primitive components) which we call “rooted Wreath products”. We identify the rooted valuation product with an appropriate subgroup of the corresponding rooted Wreath product. The maximal Abelian group actions on the ordered real line were characterised in [W], and their digital representations were consequently obtained. We use the rooted Wreath product construction to get a more general result, and deduce the characterisation in [W] as a consequence. Subject classification: 06F15, 06F20 (08A35, 26A48)
منابع مشابه
Fast Fourier Transforms for Wreath Products
In this paper fast Fourier transform algorithms (FFT's) are constructed for wreath products of the form GS n ]. Examples of interest include the hyperoctahedral groups B n (the symmetry groups of the n-cube) as well as more generally AS n ] for any abelian groups A and also the full wreath products S m S n ] and their iterates, often identiied as automorphism groups of spherically homogeneous r...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملGraph-wreath products and finiteness conditionsI
A notion of graph-wreath product of groups is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type Fn. Under various additional assumptions we show that these conditions are necessary. Our results generalize results of Bartholdi, Cornulier and Kochloukova about wreath products. Graphwreath products of groups include class...
متن کاملCommutativity Degrees of Wreath Products of Finite Abelian Groups
We compute commutativity degrees of wreath products A o B of finite abelian groups A and B . When B is fixed of order n the asymptotic commutativity degree of such wreath products is 1/n2. This answers a generalized version of a question posed by P. Lescot. As byproducts of our formula we compute the number of conjugacy classes in such wreath products, and obtain an interesting elementary numbe...
متن کاملA SOLOMON DESCENT THEORY FOR THE WREATH PRODUCTS G Sn
We propose an analogue of Solomon’s descent theory for the case of a wreath product G Sn, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht’s theory for the representations of wreath products, Okada’s extension to wreath products of the Robinson-Schensted correspondence, and Poirier’s quasisymmetric functions. We insist on the...
متن کامل